Explicit bounds for primes in residue classes

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit bounds for primes in residue classes

Let E/K be an abelian extension of number fields, with E 6= Q. Let ∆ and n denote the absolute discriminant and degree of E. Let σ denote an element of the Galois group of E/K. We prove the following theorems, assuming the Extended Riemann Hypothesis: (1) There is a degree-1 prime p of K such that ( p E/K ) = σ, satisfying Np ≤ (1 + o(1))(log ∆ + 2n)2. (2) There is a degree-1 prime p of K such ...

متن کامل

Counting primes in residue classes

We explain how the Meissel-Lehmer-Lagarias-Miller-Odlyzko method for computing π(x) can be used for computing efficiently π(x, k, l), the number of primes congruent to l modulo k up to x. As an application, we computed the number of prime numbers of the form 4n ± 1 less than x for several values of x up to 1020 and found a new region where π(x, 4, 3) is less than π(x, 4, 1) near x = 1018.

متن کامل

Explicit upper bounds for exponential sums over primes

We give explicit upper bounds for linear trigonometric sums over primes.

متن کامل

Products in Residue Classes

Abstract. We consider a problem of P. Erdős, A. M. Odlyzko and A. Sárkőzy about the representation of residue classes modulom by products of two not too large primes. While it seems that even the Extended Riemann Hypothesis is not powerful enough to achieve the expected results, here we obtain some unconditional results “on average” over moduli m and residue classes modulo m and somewhat strong...

متن کامل

PERMUTATION GROUPS WITH BOUNDED MOVEMENT ATTAINING THE BOUNDS FOR ODD PRIMES

Let G be a transitive permutation group on a set ? and let m be a positive integer. If no element of G moves any subset of ? by more than m points, then |? | [2mp I (p-1)] wherep is the least odd primedividing |G |. When the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, I i n....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1996

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-96-00763-6